Browsers Based on 2 D and 3 D Graph Drawing ( Demo )
نویسندگان
چکیده
Many problems in computer-aided design and graphics involve the process of setting and adjusting input parameters to obtain desirable output values. Exploring diierent parameter settings can be a diicult and tedious task in most such systems. In the Design Gallery TM (DG) approach, parameter setting is made easier by dividing the task more equitably between user and computer. DG interfaces present the user with the broadest selection, automatically generated and organized, of perceptually diierent designs that can be produced by varying a given set of input parameters. The DG approach has been applied to several diicult parameter-setting tasks from the eld of computer graphics: light selection and placement for image rendering; opacity and color transfer-function speciication for volume rendering; and motion control for articulated-gure and particle-system animation. The principal technical challenges posed by the DG approach are dispersion ((nding a set of input-parameter vectors that optimally disperses the resulting output values) and arrangement (arranging the resulting designs for easy browsing by the user). We show how eeective arrangement can be achieved with 2D and 3D graph drawing. While navigation is easier in the 2D interface, the 3D interface has proven to be surprisingly usable, and the 3D drawings sometimes provide insights that are not so obvious in the 2D drawings.
منابع مشابه
Design Gallery Browsers Based on 2D and 3D Graph Drawing
The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters.
متن کاملMulti-dimensional Orthogonal Graph Drawing with Small Boxes
In this paper we investigate the general position model for the drawing of arbitrary degree graphs in the D-dimensional (D ≥ 2) orthogonal grid. In this model no two vertices lie in the same grid hyperplane. We show that for D ≥ 3, given an arbitrary layout and initial edge routing a crossing-free orthogonal drawing can be determined. We distinguish two types of algorithms. Our layout-based alg...
متن کاملKetcher: web-based chemical structure editor
Ketcher is an open-source web-based chemical structure editor developed by SciTouch LLC. Being written on pure JavaScript it incorporates high performance, good portability and light weight. Editor supports late versions of all most popular browsers, such as Internet Explorer, Firefox, Safari, Opera and Chrome. It is developed with minimum third-party code to remain its light weight. It is plat...
متن کاملDrawing Graphs with Nonuniform Nodes Using Potential Fields
A potential field approach, coupled with force-directed methods, is proposed in this paper for drawing graphs with nonuniform nodes in 2-D and 3-D. In our framework, nonuniform nodes are uniformly or nonuniformly charged, while edges are modelled by springs. Using certain techniques developed in the field of potential-based path planning, we are able to find analytically tractable procedures fo...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998